List Delete( List L, ElementType minD, ElementType maxD )
{
    int size = L->Last, i = 0;
    while(i <= size)
    {
        if(L->Data[i] > minD && L->Data[i] < maxD)
        {
            for(int j = i; j <= size - 1; j++)
            {
                L->Data[j] = L->Data[j + 1];
            }
            size--;
        }
        else
        {
            i++;     
        }
    }

    L->Last = size;
    
    return L;
}